Digitized-counterdiabatic quantum approximate optimization algorithm
نویسندگان
چکیده
The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum serving multiple purposes, from solving combinatorial problems finding the ground state of many-body systems. Since QAOA is ansatz-dependent algorithm, there always a need design ansatz for better optimization. To this end, we propose digitized version enhanced via use shortcuts adiabaticity. Specifically, counterdiabatic (CD) driving term ansatz, along with Hamiltonian and mixing terms, enhancing global performance. We apply our digitized-counterdiabatic Ising models, classical problems, P-spin model, demonstrating that it outperforms standard in all cases study.
منابع مشابه
Temporal Planning for Compilation of Quantum Approximate Optimization Algorithm Circuits
We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and allow highly parallel plans. We report on experiments using several temporal planners to compile ci...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملTemporal Planning for Compilation of Quantum Approximate Optimization Circuits
We investigate the application of temporal planners to the problem of compiling quantum circuits to emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and thus allow highly parallel plans. We report on experiments using several temporal planners to compile cir...
متن کاملAn approximate algorithm for combinatorial optimization problems with two parameters
We call a minimum cost restricted time combinatorial optimization (MCRT) problem any problem that has a finite set P, finite family S of subsets of P, non-negative threshold h, and two non-negative real-valued functions y : (say, cost) and x : p......-? R+ (say, time). One seeks a solution F* E S with y(F*) min{y(F): F E S, x(F):S h}, where x(G) L:gEGx(g), y(G) = L:gEGy(g) and G E S. We also as...
متن کاملA nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
A new nonmonotone algorithm is proposed and analyzed for unconstrained nonlinear optimization. The nonmonotone techniques applied in this algorithm are based on the estimate sequence proposed by Nesterov (Introductory Lectures on Convex Optimization: A Basic Course, 2004) for convex optimization. Under proper assumptions, global convergence of this algorithm is established for minimizing genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review research
سال: 2022
ISSN: ['2643-1564']
DOI: https://doi.org/10.1103/physrevresearch.4.013141